Optimal Scheduling Using Branch and Bound with SPIN 4.0

The use of model checkers to solve discrete optimisation problems is appealing. A model checker can first be used to verify that the model of the problem is correct. Subsequently, the same model can be used to find an optimal solution for the problem. This paper describes how to apply the new PROMELA primitives of SPIN 4.0 to search effectively for the optimal solution. We show how Branch-and-Bound techniques can be added to the LTL property that is used to find the solution. The LTL property is dynamically changed during the verification. We also show how the syntactical reordering of statements and/or processes in the PROMELA model can improve the search even further. The techniques are illustrated using two running examples: the Travelling Salesman Problem and a job-shop scheduling problem

Verification and Optimization of a PLC Control Schedule

We report on the use of the SPIN model checker for both the verification of a process control program and the derivation of optimal control schedules. This work was carried out as part of a case study for the EC VHS project (Verification of Hybrid Systems), in which the program for a Programmable Logic Controller (PLC) of an experimental chemical plant had to be designed and verified. The intention of our approach was to see how much could be achieved here using the standard model checking environment of SPIN/Promela. As the symbolic calculations of real-time model checkers can be quite expensive it is interesting to try and exploit the efficiency of established non-real-time model checkers like SPIN in those cases where promising work-arounds seem to exist. In our case we handled the relevant real-time properties of the PLC controller using a time-abstraction technique; for the scheduling we implemented in Promela a so-called variable time advance procedure. For this case study these techniques proved sufficient to verify the design of the controller and derive (time-)optimal schedules with reasonable time and space requirements

Staging Laparoscopy for Hilar Cholangiocarcinoma: Is it Still Worthwhile?

This study was designed to evaluate the benefit of staging laparoscopy (SL) in patients with suspected hilar cholangiocarcinoma (HCCA) during the past 10 years. Only 50-60% of patients with HCCA who undergo laparotomy are ultimately amenable to a potentially curative resection. In a previous study, we recommended routine use of SL to prevent unnecessary laparotomies. The accuracy of imaging techniques, however, has significantly improved during the past decade, which is likely to impact the yield and accuracy of SL. From 2000 to 2010, 195 patients with suspected HCCA were analyzed. The yield and accuracy of SL were calculated by dividing total number of avoided laparotomies by the total number of laparoscopies or by all patients with unresectable disease, respectively. Factors associated with better yield and accuracy were assessed. Of 195 patients with HCCA, 175 underwent SL. The yield of SL was 14% and the accuracy was 32%. Operative morbidity of SL was 3%, and operative morbidity of laparotomy for unresectable disease was 33%. No clear factors that influenced the yield of SL were found. Overall yield and accuracy of SL for HCCA in the present series decreased to 14% and 32%, respectively, compared with earlier reports. This finding is likely the result of improved imaging techniques that evolved during the past decade. The place of SL in the workup of patients with HCCA needs to be reconsidered, and one should decide whether the declining additional value of SL still outweighs the drawbacks of S

Metal-polymer functionally graded materials for removing guided wave reflections at beam end boundaries

This paper investigates the potential of a metal-polymer functionally graded material (FGM) to remove beam end boundary wave reflections that produce complicated interference patterns in the response signals used for guided wave damage identification methodologies. The metal-polymer FGM matches the material properties to a metal beam for total wave transmission on one side and is continuously graded to a viscoelastic polymer on the other side. An Aluminium-Polycarbonate (Al-PC) FGM was fabricated and characterised using microscopy, hardness testing and through-transmission ultrasonics to verify the continuous gradient. Measurements of guided waves on an aluminium beam attached to the FGM on one end show reduction in boundary wave reflections that varies with wave frequency. A damaged aluminium beam attached with the FGM produced promising improvements in a damage identification system

Application profiling and resource management for MapReduce

Scale of data generated and processed is exponential growth in the Big Data ear. It poses a challenge that is far beyond the goal of a single computing system. Processing such vast amount of data on a single machine is impracticable in term of time or cost. Hence, distributed systems, which can harness very large clusters of commodity computers and processing data within restrictive time deadlines, are imperative. In this thesis, we target two aspects of distributed systems: application profiling and resource management. We study a MapReduce system in detail, which is a programming paradigm for large scale distributed computing, and presents solutions to tackle three key problems. Firstly, this thesis analyzes the characteristics of jobs running on the MapReduce system to reveal the problem—the Application scope of MapReduce has been extended beyond the original design goal that was large-scale data processing. This problem enables us to present a Workload Characteristic Oriented Scheduler (WCO), which strives for co-locating tasks of possibly different MapReduce jobs with complementing resource usage characteristics. Secondly, this thesis studies the current job priority mechanism focusing on resource management. In the MapReduce system, job priority only exists at scheduling level. High priority jobs are placed at the front of the scheduling queue and dispatched first. Resource, however, is fairly shared among jobs running at the same worker node without any consideration for their priorities. In order to resolve this, this thesis presents a non-intrusive slot layering solution, which dynamically allocates resource between running jobs based on their priority and efficiently reduces the execution time of high priority jobs while improves overall throughput. Last, based on the fact of underutilization of resource at each individual worker node, this thesis propose a new way, Local Resource Shaper (LRS), to smooth resource consumption of each individual job by automatically tuning the execution of concurrent jobs to maximize resource utilization while minimizing resource contention

Optimal Scheduling Using Branch and Bound with SPIN 4.0

The use of model checkers to solve discrete optimisation problems is appealing. A model checker can first be used to verify that the model of the problem is correct. Subsequently, the same model can be used to find an optimal solution for the problem. This paper describes how the new Promela primitives of Spin 4.0 can be applied to search e#ectively for the optimal solution. We show how Branch-and-Bound techniques can be added to the LTL property that is used to find the solution. The LTL property is dynamically changed during the verification

Surgical Treatment of Renal Cell Cancer Liver Metastases: A Population-Based Study

Background: To evaluate outcomes of surgical treatment in patients with hepatic metastases from renal-cell carcinoma in the Netherlands, and to identify prognostic factors for survival after resection. Renal-cell carcinoma has an incidence of 2,000 new patients in the Netherlands each year (12.5/100,000 inhabitants). According to literature, half of these patients ultimately develop distant metastases with 20% involvement of the liver. Resection of renal-cell carcinoma liver metastases (RCCLM) is performed in only a minority of patients. Hence, little is known about outcome of resectable RCCLM. Methods: Patients were retrieved from local databases of theNetherlands Task Force for Liver Surgery (14 centers) and from the Dutch collective pathology database. Survival and prognostic factors were determined by Kaplan-Meier analysis and log rank test. Results: Thirty-three patients were identified who underwent resection (n = 29) or local ablation (n = 4) of RCCLM in the Netherlands between 1990 and 2008. These patients comprise 0.5% to 1% of the total population of patients diagnosed with RCCLM in that period. There was no operative mortality. The overall survival at 1, 3, and 5 years was 79, 47, and 43%, respectively. Metachronous metastases (n = 23, P = 0.03) and radical resection (n = 19, P < 0.001) were statistically significant prognosticators of ov

Chemical characterization of some substituted hydroxyapatites

Synthetic multi-substituted hydroxyapatite nano powders containing silicon and or carbonate prepared by a wet chemical method. The process parameters are set up to allow the simultaneous substitution of carbonate and silicon ions in the place of phosphorus. The chemical and structural characterizations of the prepared powders are determined with the aid of; XRF, ICP, XRD and FTIR. The results show that, the ion substitution in the crystal lattice of HA caused a change in the unit cell dimensions and affected the degree of crystallization of the produced powders. The apatite formation abilityy of the prepared discs from the synthesized powders is determined by immersing in SBF solution for different periods. The degree of ion release was determined in the obtained solutions. The examined surface of the immersed discs under SEM and analyzed by CDS showed a more dense HA layer than those of un-substituted ones. The HA with the substituted silicon and carbonate ions, showed the highest solubility with greater rate of ion release, compared with carbonate-free powder. All prepared powders took sodium ion from the SBF solution during immersion, which was not recorded before